On atomic registers and randomized consensus in M&M systems

Motivated by recent distributed systems technology, Aguilera et al. introduced a hybrid model of computing, called the message-and-memory or m&m for short. In this model, processes can communicate message passing and also accessing some shared memory (e.g., through RDMA connections). We first consider basic problem implementing an atomic single-writer multi-reader (SWMR) register all in systems. Specifically, we give algorithm that implements such show it is optimal number process crashes tolerates. This generalizes well-known ABD implementation SWMR pure message-passing system. then combine our with randomized consensus Aspnes Herlihy, obtain tolerate. Finally, determine minimum connections sufficient to implement register, solve consensus, system t crashes, any given t.